منابع مشابه
The International SAT Solver Competitions
is satisfiable is one of the most fundamental problems in computer science, known as the canonical NP-complete Boolean satisfiability (SAT) problem (Biere et al. 2009). In addition to its theoretical importance, major advances in the development of robust implementations of decision procedures for SAT, SAT solvers, have established SAT as an important declarative approach for attacking various ...
متن کاملTypical-case complexity and the SAT competitions
The aim of this paper is to gather insight into typical-case complexity of the Boolean Satis ability (SAT) problem by mining the data from the SAT competitions. Speci cally, the statistical properties of the SAT benchmarks and their impact on complexity are investigated, as well as connections between di erent metrics of complexity. While some of the investigated properties and relationships ar...
متن کاملEureka-2008 SAT Solver
We describe the SAT solver Eureka. Eureka is a state-of-the-art SAT solver, used in various Formal Verification flows at Intel. Eureka is based upon backtrack search DLL algorithm, enhanced by failure-driven assertion loop; nonstandard conflict analyses; restart and clause deletion strategies; CBH decision heuristic and decision stack shrinking.
متن کاملAn Adaptive SAT Solver
This proposal outlines the creation of an adaptive algorithm for the Propositional Satisfiability Problem (SAT). The SAT problem is of great importance in theoretical computer science and verification. The proposed algorithm, or solver, uses the well-known DPLL approach coupled with a variety of optimizations and extensions which are selectively turned on and off during runtime to adapt to the ...
متن کاملAn Extensible SAT-solver
In this article, we present a small, complete, and efficient SAT-solver in the style of conflict-driven learning, as exemplified by CHAFF. We aim to give sufficient details about implementation to enable the reader to construct his or her own solver in a very short time. This will allow users of SAT-solvers to make domain specific extensions or adaptions of current state-of-the-art SAT-techniqu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AI Magazine
سال: 2012
ISSN: 2371-9621,0738-4602
DOI: 10.1609/aimag.v33i1.2395